On Quadratic Hurwitz Stability of Interval Polynomials

On Robust Hurwitz Polynomials

In this note, Kharitonov's theorem on robust Hunvitz poljmomials is simplified for low-order polynomials. Specifically, for n = 3, 4, and 5, the number of polynomials required to check robust stability is one, two, and three, respectively, instead of four. Furthermore, it is shown that for n > 6, the number of polynomials for robust stability checking is necessarily four, thus further simplific...

Real Roots of Quadratic Interval Polynomials

The aim of this paper is to study the roots of interval polynomials. The characterization of such roots is given and an algorithm is developed for computing the interval roots of quadratic polynomials with interval coefficients. Mathematics Subject Classification: 65G40

Robust Hurwitz stability of polytopes of complex polynomials

The main goal of this note is to provide a complete tool for verifying whether polytopes of complex polynomials whose degrees differ at most by one are Hurwitz stable. The results extend some classical theorems, such as the Edge Theorem given by Bartlett, Hollot and Huang (1988), its generalizations proposed by Sideris and Barmish (1989), Fu and Barmish (1989), and the eigenvalue criterion give...

Quadratic Matrix Inequalities and Stability of Polynomials

New relationships are enlightened between various quadratic matrix inequality conditions for stability of a scalar polynomial. It is namely shown how a recently published linear matrix inequality condition can be derived from Hermite and Lya-punov stability criteria.

Analyzing the Stability Robustness of Interval Polynomials